A translational approach to constraint answer set solving
نویسندگان
چکیده
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.
منابع مشابه
Modern Constraint Answer Set Solving
Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capabilities. Although this has already resulted in various applications, certain aspects of such applications are more naturally modeled using variables over finite domains, for accounting for resources, fine timings, coordinates, or functions. Our...
متن کاملConstraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different solver types. We have implemented our app...
متن کاملConflict-Driven Disjunctive Answer Set Solving
We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on state-of-theart Boolean constraint solving techniques. Starting from a constraint-based characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflict-driven learning using the First-UIP scheme as well as sophisticated unfounded set checking. As a final re...
متن کاملConflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation
We present a new approach to enhancing answer set programming (ASP) with constraint programming (CP) techniques based on conflict-driven learning and lazy nogood generation.
متن کاملKinematic and Dynamic Analysis of Tripteron, an Over-constrained 3-DOF Translational Parallel Manipulator, Through Newton-Euler Approach
In this research, as the main contribution, a comprehensive study is carried out on the mathematical modeling and analysis of the inverse kinematics and dynamics of an over-constraint three translational degree-of-freedom parallel manipulator. Due to the inconsistency between the number of equations and unknowns, the problem of obtaining the constraint forces and torques of an over-constraint m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 10 شماره
صفحات -
تاریخ انتشار 2010